منابع مشابه
On-Line List Colouring of Graphs
This paper studies on-line list colouring of graphs. It is proved that the online choice number of a graph G on n vertices is at most χ(G) ln n + 1, and the on-line b-choice number of G is at most eχ(G)−1 e−1 (b − 1 + lnn) + b. Suppose G is a graph with a given χ(G)-colouring of G. Then for any (χ(G) ln n + 1)-assignment L of G, we give a polynomial time algorithm which constructs an L-colourin...
متن کاملOn-line List Colouring of Random Graphs
In this paper, the on-line list colouring of binomial random graphs G (n, p) is studied. We show that the on-line choice number of G (n, p) is asymptotically almost surely asymptotic to the chromatic number of G (n, p), provided that the average degree d = p(n − 1) tends to infinity faster than (log logn)(logn)n. For sparser graphs, we are slightly less successful; we show that if d ≥ (logn) fo...
متن کاملList Colouring Big Graphs On-Line
In this paper, we investigate the problem of graph list colouring in the on-line setting. We provide several results on paintability of graphs in the model introduced by Schauz [13] and Zhu [19]. We prove that the on-line version of Ohba’s conjecture is true in the class of planar graphs. We also consider several alternate on-line list colouring models.
متن کاملPOINTWISE PSEUDO-METRIC ON THE L-REAL LINE
In this paper, a pointwise pseudo-metric function on the L-realline is constructed. It is proved that the topology induced by this pointwisepseudo-metric is the usual topology.
متن کاملOn-Line List Colouring of Complete Multipartite Graphs
The Ohba Conjecture says that every graph G with |V (G)| ≤ 2χ(G) + 1 is chromatic choosable. This paper studies an on-line version of Ohba Conjecture. We prove that unlike the off-line case, for k ≥ 3, the complete multipartite graph K2?(k−1),3 is not on-line chromatic-choosable. Based on this result, the on-line version of Ohba Conjecture is modified as follows: Every graph G with |V (G)| ≤ 2χ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1985
ISSN: 0095-8956
DOI: 10.1016/0095-8956(85)90039-5